Strong and semi strong outer mod sum graphs
نویسندگان
چکیده
منابع مشابه
Strong and Semi Strong Outer Mod Sum Graphs
A semi strong outer mod sum labeling of a graph G is an injective mapping f : V (G) → Z+ with an additional property that for each vertex v of G, there exist vertices w1, w2 in V (G) such that f(w1) = ∑ u∈N(v) f(u) and f(v) = ∑ u∈N(w2) f(u), where both the sums are taken under addition modulo m for some positive integer m. A graph G which admits a semi strong outer mod sum labeling is called a ...
متن کاملStrong Alliances in Graphs
For any simple connected graph $G=(V,E)$, a defensive alliance is a subset $S$ of $V$ satisfying the condition that every vertex $vin S$ has at most one more neighbour in $V-S$ than it has in $S$. The minimum cardinality of any defensive alliance in $G$ is called the alliance number of $G$, denoted $a(G)$. In this paper, we introduce a new type of alliance number called $k$-strong alliance numb...
متن کاملStrong sum distance in fuzzy graphs
In this paper the idea of strong sum distance which is a metric, in a fuzzy graph is introduced. Based on this metric the concepts of eccentricity, radius, diameter, center and self centered fuzzy graphs are studied. Some properties of eccentric nodes, peripheral nodes and central nodes are obtained. A characterisation of self centered complete fuzzy graph is obtained and conditions under which...
متن کاملOn the Strong Metric Dimension of Cartesian Sum Graphs
A vertex w of a connected graph G strongly resolves two vertices u, v ∈ V (G), if there exists some shortest u−w path containing v or some shortest v−w path containing u. A set S of vertices is a strong metric generator for G if every pair of vertices of G is strongly resolved by some vertex of S. The smallest cardinality of a strong metric generator for G is called the strong metric dimension ...
متن کاملGood and Semi-Strong Colorings of Oriented Planar Graphs
A k?coloring of an oriented graph G = (V; A) is an assignment c of one of the colors 1; 2; : : :; k to each vertex of the graph such that, for every arc (x; y) of G, c(x) 6 = c(y). The k?coloring is good if for every arc (x; y) of G there is no arc (z; t) 2 A such that c(x) = c(t) and c(y) = c(z). A k?coloring is said to be semi?strong if for every vertex x of G, c(z) 6 = c(t) for any pair fz; ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematical Analysis
سال: 2013
ISSN: 1314-7579
DOI: 10.12988/ijma.2013.13009